|
|
Use of a simulation model for the development of an automatic algorithm for creating a routing table and path evaluation in a conveyor system
Weyrová, Dominika ; Simeonov, Simeon (referee) ; Hromková, Ivana (advisor)
The diploma thesis deals with the use of a simulation model for the development of an automatic algorithm for the creation of a routing table and route evaluation in a transport system. It includes a search of modeling and simulation issues and state-space search issues with an analysis of available search methods. The simulation model of the transport system is created in the software Tecnomatix Plant Simulation, where an algorithm for automatic creation of routing tables for routing and evaluation of routes according to static criteria is subsequently developed and tested. The work presents a proposal for the principle of the algorithm for evaluating the routes of the transport system, including dynamic criteria and their optimization.
|
|
|
Sorting algorithms
Lýsek, Jiří ; Šeda, Miloš (referee) ; Dvořák, Jiří (advisor)
This thesis deals with a problem of sorting arrays, which is one of known problems in computer science. It defines concepts of sorting, algorithm and algorithm complexity. It describes sorting algorithms from the easiest ones to the selected more difficult methods. Finally, the algorithms are compared according to number of needed operations and time needed for the whole sorting process.
|
|
|
Ant Colony Optimization: Implementace a testování biologicky inspirované optimalizační metody
Havlík, Michal
Havlík, M. Ant Colony Optimization: Implementation and testing of bio-inspired optimization method. Diploma thesis. Brno, 2015. This thesis deals with the implementation and testing of algorithm Ant Colony Optimization as a representative of the family of bio-inspired opti-mization methods. A given algorithm is described, analyzed and subsequently put into context with the problems which can be solved. Based on the collec-ted information is designed implementation that solves the Traveling sale-sman problem. Implementation contains graphical user interface to track the algorithm. Implementation is further optimized using parallel programming and other methods. Finally the implementation compared and summarized results.
|
|
|
Use of a simulation model for the development of an automatic algorithm for creating a routing table and path evaluation in a conveyor system
Weyrová, Dominika ; Simeonov, Simeon (referee) ; Hromková, Ivana (advisor)
The diploma thesis deals with the use of a simulation model for the development of an automatic algorithm for the creation of a routing table and route evaluation in a transport system. It includes a search of modeling and simulation issues and state-space search issues with an analysis of available search methods. The simulation model of the transport system is created in the software Tecnomatix Plant Simulation, where an algorithm for automatic creation of routing tables for routing and evaluation of routes according to static criteria is subsequently developed and tested. The work presents a proposal for the principle of the algorithm for evaluating the routes of the transport system, including dynamic criteria and their optimization.
|
|
|
Sorting algorithms
Lýsek, Jiří ; Šeda, Miloš (referee) ; Dvořák, Jiří (advisor)
This thesis deals with a problem of sorting arrays, which is one of known problems in computer science. It defines concepts of sorting, algorithm and algorithm complexity. It describes sorting algorithms from the easiest ones to the selected more difficult methods. Finally, the algorithms are compared according to number of needed operations and time needed for the whole sorting process.
|
|
|
Ant Colony Optimization: Implementace a testování biologicky inspirované optimalizační metody
Havlík, Michal
Havlík, M. Ant Colony Optimization: Implementation and testing of bio-inspired optimization method. Diploma thesis. Brno, 2015. This thesis deals with the implementation and testing of algorithm Ant Colony Optimization as a representative of the family of bio-inspired opti-mization methods. A given algorithm is described, analyzed and subsequently put into context with the problems which can be solved. Based on the collec-ted information is designed implementation that solves the Traveling sale-sman problem. Implementation contains graphical user interface to track the algorithm. Implementation is further optimized using parallel programming and other methods. Finally the implementation compared and summarized results.
|
guest ::
